Model with two types of CTL regulation and experiments on CTL dynamics
نویسندگان
چکیده
منابع مشابه
CTL and Equivalent Sublanguages of CTL
Specifications of finite state algorithms with a complex temporal behavior such as protocols or hardware systems are often given in temporal logics as e.g. CTL or CTL . On the one hand, CTL offers in comparison to CTL efficient model checking algorithms, but on the other hand, CTL seems to suffer from a limited expressiveness. In this paper, it is shown that the limitations one feels when using...
متن کاملOn the Hybrid Extension of CTL and CTL+
The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branching-time logics CTL and CTL by variables. Previous complexity results show that only fragments with one variable do have elementary complexity. It is shown that HCTL and HCTL, the hybrid extensions with one variable of CTL and CTL, respectively, are expressively equivale...
متن کاملOCL meets CTL: Towards CTL-Extended OCL Model Checking
In software modeling, the Object Constraint Language (OCL) is an important tool to specify properties that a model has to satisfy. The design of OCL reflects the structure of MOF-based modeling languages like UML and the tight integration results in an intuitive usability. However, OCL allows to express properties in the context of the current state of an instance model only but not with respec...
متن کاملModel Checking Ctl Is
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations—restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004). For all these fragments, except for the trivial case without any temporal operator...
متن کاملReducing Model Checking from Multi-valued Ctl to Ctl
A multi-valued version of CTL (mv-CTL), where both the propositions and the accessibility relation are multi-valued taking values in a nite quasi-boolean algebra, is considered. A general translation from mv-CTL to CTL model checking is deened. An application of the translation is shown for the most commonly used quasi-boolean algebras.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Theoretical Biology
سال: 2010
ISSN: 0022-5193
DOI: 10.1016/j.jtbi.2009.11.003